Static-List Time-Constrained Scheduling Based On Topological Clustering

Static-list scheduling algorithms are constructive heuristics with a low complexity and highly useful for design space exploration. In this paper, we present a static-list scheduling algorithm that incorporates a novel topological clustering heuristic. Based on the clustering heuristic, we have developed a simple operation selection function and a combination of two cost functions to determine the time step for scheduling an operation. Results show signiicantly higher quality schedules over another recent work on static-list scheduling that outperforms other scheduling techniques in the literature. The proposed technique, although having a low-complexity, is eeective in moving towards an optimal schedule.